Advancing equitability in multiobjective programming
نویسندگان
چکیده
منابع مشابه
Advancing declarative programming
This thesis attempts to unite and consolidate two large and often culturally disjoint programming paradigms: declarative (focusing on specifying what a program is supposed to do, e.g., shuffle an array so that its elements are ordered) and imperative (detailing how the program intention is to be implemented, e.g., by applying the QuickSort algorithm). The ultimate result of such an effort would...
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملmultiobjective geometric programming with fuzzy parameters
generally, an engineering design problem has multiple objective functions. some of these problems can be formulated as multiobjective geometric programming models. on the other hand,often in the real world, coefficients of the objective functions are not known precisely. coefficients may be interpreted as fuzzy numbers, which lead to a multiobjective geometric programming with fuzzy parameters....
متن کاملThe Position of Multiobjective Programming Methods in Fuzzy Data Envelopment Analysis
Traditional Data Envelopment Analysis (DEA) models evaluate the efficiency of decision making units (DMUs) with common crisp input and output data. However, the data in real applications are often imprecise or ambiguous. This paper transforms fuzzy fractional DEA model constructed using fuzzy arithmetic, into the conventional crisp model. This transformation is performed considering the goal pr...
متن کاملSecond Order Duality in Multiobjective Programming
A nonlinear multiobjective programming problem is considered. Weak, strong and strict converse duality theorems are established under generalized second order (F, α, ρ, d)-convexity for second order Mangasarian type and general Mond-Weir type vector duals.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2006
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2006.08.014